A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique

نویسندگان

  • Peter M. Hahn
  • Matthew J. Saltzman
چکیده

We report on the implementation of a level-3 reformulation linearization technique (RLT-3)-based bound calculation in a branch-and-bound algorithm. The RLT-3-based bound calculation method is not guaranteed to calculate the RLT-3 lower bound exactly, but approximates it very closely and reaches it in some instances. We tested the new branch-andbound solver on six Nugent instances, 15, 18, 20, 22, 24 and 25. The computational results indicate that the new technique should be effective in solving problem sizes larger than had been possible to date. Solving QAP problems sizes larger than size 25 with this new exact solution technique still presents a challenge due to the large memory needed to implement the RLT-3 formulation. We discuss our plans to improve the implementation of the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory-Aware Parallelized RLT3 for solving Quadratic Assignment Problems

We present a coarse-grain (outer-loop) parallel implementation of RLT1/2/3 (Level 1, 2, and 3 Reformulation and Linearization Technique—in that order) bound calculations for the QAP within a branch-and-bound procedure. For a search tree node of size S, each RLT3 and RLT2 bound calculation iteration is parallelized S ways, with each of S processors performing O(S) and O(S) linear assignment prob...

متن کامل

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

We apply the level-3 Reformulation Linearization Technique (RLT3) to the Quadratic Assignment Problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm, based on this RLT3 formulation. This algorithm is not guaranteed to calculate the RLT3 lower bound exactly, but approximates it very closely and reaches it in some instances. For Nugent problem...

متن کامل

Solving Standard Quadratic Programming by Cutting Planes

Standard quadratic programs are non-convex quadratic programs with the only constraint that variables must belong to a simplex. By a famous result of Motzkin and Straus, those problems are connected to the clique number of a graph. In this paper, we study cutting plane techniques to obtain strong bounds for standard quadratic programs. Our cuts are derived in the context of a Spatial Branch & B...

متن کامل

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique

In this paper, we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). In this problem, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...

متن کامل

Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm

The application of the Reformulation Linearization Technique (RLT) to the Quadratic Assignment Problem (QAP) leads to a tight linear relaxation with huge dimensions that is hard to solve. Previous works found in the literature show that these relaxations combined with branch-and-bound algorithms belong to the state-of-the-art of exact methods for the QAP. For the level 3 RLT (RLT3), using this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Stud. Inform. Univ.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2010